A low-rate improvement on the Elias bound (Corresp.)

نویسندگان

  • Lloyd R. Welch
  • Robert J. McEliece
  • Howard Rumsey
چکیده

RU4LEtWH&!4sl-A'ERG RU4LEtWH&!4sl Fig. 1. Fig. 1. Entropy per cell as function of average run length. Entropy per cell as function of average run length. distributed: for tl 2 0 for tl < 0 where t, is the (continuous) run length. The average run length is f, = 6. (20) Now, suppose the continuous run length tl is quantized to obtain the discrete run length t : t = [t1] + 1 (21) where [tl] = largest integer in t,. (23) 1 t=-. 1-ebb Letting .? = a, we obtain 1 a=-1-e-* or b = log a. a-l Substituting (26) into (23), we obtain (25) (26) 1 qi=-e-Cloga-Iog(a-1)11 a-l which is identical to (15). Therefore, the quantized Poisson square wave achieves the maximum entropy given by (16). (28) After the aforementioned analysis was performed, it was found that the quantized Poisson square wave is identical to Capon's first-order Markov chain model [l 1, if we set P(0 IO) = P(1 1 1) = 9. Therefore, although Capon apparently did not realize it, the saving in bits predicted by his model is actually a lower bound for any two-level source with average white run length l/ (1-P(l 1 1)) and average black run length l/(1-P(0 IO)), because the run lengths in Capon's model are independent, and the exponential distributions of the white run lengths and the black run lengths ensure that both achieve the maximum entropy. REFERENCES [l] J. Capon, " A probabilistic model for run-length coding of pictures, " IRE Trans. Absrrucr-An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound for R < 0.0509+, is obtained. The new bound has the same derivative (co) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative-In 2 at R = 0). For R between 0 and 1 denote by d(n,R) the largest possible minimum distance for a binary block code of length n and rate 2 R. It is unknown whether D(R) = lim i d(n,R) n-rm I1 exists, so let us define D(R) = lim sup 1 d(n,R) n-bm n e(R) = lim inf 1 d(n,R). n-too n Until now the best bounds on D(R) and p(R) have been L!(R) 2 fU-RI

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improvement of the asymptotic Elias bound for non-binary codes

For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of these bounds which improves both. This in turn is based on the anticode bound which is a hybrid of the Hamming and Singleton bounds and improves both bounds. Th...

متن کامل

A class of Artinian local rings of homogeneous type

‎Let $I$ be an ideal in a regular local ring $(R,n)$‎, ‎we will find‎ ‎bounds on the first and the last Betti numbers of‎ ‎$(A,m)=(R/I,n/I)$‎. ‎if $A$ is an Artinian ring of the embedding‎ ‎codimension $h$‎, ‎$I$ has the initial degree $t$ and $mu(m^t)=1$‎, ‎we call $A$ a {it $t-$extended stretched local ring}‎. ‎This class of‎ ‎local rings is a natural generalization of the class of stretched ...

متن کامل

Lecture 6 : The Elias - Bassalygo Bound

We currently know the following four bounds on rate as a function of relative distance, three of them upper bounds (which tell us what rate-distance combinations are impossible), and one lower bound (which tells us what rate-distance combinations we can achieve). In the following, R is the rate and δ the relative distance of a code. For example, a (n, k, d) code has R = k/n and δ = d/n. Hq(x) i...

متن کامل

Bound Putrescine, a Distinctive Player under Salt Stress in the Natrophilic Sugar Beet in Contrast to Glycophyte Tobacco

The influence of salinity on the different polyamine fractions (free, conjugated, and bound) was compared in a natrophilic halophyte (Beta vulgaris L. cv. IC) and a salt sensitive glycophyte (Nicotiana rustica L. cv. Basmas). Low-level salinity (25 mM NaCl) and high salinity (150 and 50 mM NaCl for sugar beet and tobacco, respectively) were supplied in hydroponics. Under low salinity shoot dry ...

متن کامل

A distribution-free performance bound in error estimation (Corresp.)

It is shown that distribution-free confidence intervals can be placed about the resubstitution estimate of the probability of error of any linear discrimination procedure.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 20  شماره 

صفحات  -

تاریخ انتشار 1974